منابع مشابه
Free Lattice Algorithms
In the late 1930s Phillip Whitman gave an algorithm for deciding for lattice terms u and u if u < u in the free lattice on the variables in u and u. He also showed that each element of the free lattice has a shortest term representing it and this term is unique up to commutivity and associativity. He gave an algorithm for finding this term. Almost all the work on free lattices uses these algori...
متن کاملFast Wait-free Algorithms for Lattice Agreement and Renaming
In a shared-memory system, n independent asynchronous processes, with distinct names in the range f0; : : : ; N ? 1g, communicate by reading and writing to shared memory; processes operate at diierent speeds or fail entirely. A wait-free algorithm guarantees that a non-faulty process completes its execution regardless of the behavior of other processes, thus tolerating an arbitrary number of cr...
متن کاملAlgorithms for lattice games
This paper provides effective methods for the polyhedral formulation of impartial finite combinatorial games as lattice games [GMW09, GM09]. Given a rational strategy for a lattice game, a polynomial time algorithm is presented to decide (i) whether a given position is a winning position, and to find a move to a winning position, if not; and (ii) to decide whether two given positions are congru...
متن کاملProgress in lattice algorithms
This conference illustrated that most large collaborations actively investigating QCD physics are performing simulations of the theory with dynamical quark fields. Dynamical staggered fermion simulations have been pursued for many years now, however it is clear that the community is now also firmly in the era of full Wilson fermion studies. These calculations will address one of the biggest sys...
متن کاملOn Lattice-Free Orbit Polytopes
Given a permutation group acting on coordinates of R, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called core points and they play a key role in a recent approach to exploit symmetry in integer convex optimization problems. Here, naturally the question arises, for which groups the number of core points is Vni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 1987
ISSN: 0167-8094,1572-9273
DOI: 10.1007/bf00340775